Optimal Probability Inequalities for Random Walks Related to Problems in Extremal Combinatorics
نویسندگان
چکیده
Vilnius University Institute of Mathematics and Informatics, Akademijos 4, LT-08663, Vilnius, Lithuania ([email protected]) Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152-3240, USA ([email protected]) Department of Discrete Mathematics, Adam Mickiewicz University, Umultowska 87, 61-614 Poznań, Poland ([email protected]) This research was funded by a grant (No. MIP-47/2010) from the Research Council of Lithuania
منابع مشابه
Probabilistic and Extremal Combinatorics∗ Organizers
Combinatorics, sometimes also called Discrete Mathematics, is a branch of mathematics focusing on the study of discrete objects and their properties. Although Combinatorics is probably as old as the human ability to count, the field experienced tremendous growth during the last fifty years and has matured into a thriving area with its own set of problems, approaches and methodology. Extremal an...
متن کاملBoolean Functions: Influence, threshold and noise
This lecture studies the analysis of Boolean functions and present a few ideas, results, proofs, and problems. We start with the wider picture of expansion in graphs and then concentrate on the graph of the n-dimensional discrete cube Ωn. Boolean functions are functions from Ωn to {0, 1}. We consider the notion of the influence of variables on Boolean functions. The influence of a variable on a...
متن کاملExact Mixing Times for Random Walks on Trees
We characterize the extremal structures for certain random walks on trees. Let G = (V,E) be a tree with stationary distribution π. For a vertex i ∈ V , let H(π, i) and H(i, π) denote the expected lengths of optimal stopping rules from π to i and from i to π, respectively. We show that among all trees with |V | = n, the quantities mini∈V H(π, i), maxi∈V H(π, i), maxi∈V H(i, π) and ∑ i∈V πiH(i, π...
متن کاملRandom differential inequalities and comparison principles for nonlinear hybrid random differential equations
In this paper, some basic results concerning strict, nonstrict inequalities, local existence theorem and differential inequalities have been proved for an IVP of first order hybrid random differential equations with the linear perturbation of second type. A comparison theorem is proved and applied to prove the uniqueness of random solution for the considered perturbed random differential eq...
متن کاملComparing Graphs of Different Sizes
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of independent sets, among other combinatorial quantities. Our methods involve inequalities for determinants, for traces of functions of operators, and for entr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 26 شماره
صفحات -
تاریخ انتشار 2012